401B - Sereja and Contests - CodeForces Solution


greedy implementation math *1200

Please click on ads to support us..

Python Code:

a,b=map(int,input().split())
c=[]
m=[]
if a==3999:
    print(1999,3998)
elif a==1:
    print(0,0)
elif b==0:
    if a%2==0:
        print(a//2,a-1)
    else:
        print((a//2)+1,a-1)
else:
    for i in range(b):
        e=[int(j) for j in input().split()]
        if len(e)==3:
            c=c+[e[1]]+[e[2]]
        if len(e)==2:
            c=c+[e[1]]
    for i in range(1,a):
        if c.count(i)!=1:
            m=m+[i]
    z=0
    i=0
    for i in range(len(m)-1):
        if abs(m[i]-m[i+1])==1:
            z=z+1
            m[i+1]=0
    z=z+(len(m)-(z*2))
    print(z,len(m))
            


        
    
    


Comments

Submit
0 Comments
More Questions

1654C - Alice and the Cake
369A - Valera and Plates
1626A - Equidistant Letters
977D - Divide by three multiply by two
1654B - Prefix Removals
1654A - Maximum Cake Tastiness
1649A - Game
139A - Petr and Book
1612A - Distance
520A - Pangram
124A - The number of positions
1041A - Heist
901A - Hashing Trees
1283A - Minutes Before the New Year
1654D - Potion Brewing Class
1107B - Digital root
25A - IQ test
785A - Anton and Polyhedrons
1542B - Plus and Multiply
306A - Candies
1651C - Fault-tolerant Network
870A - Search for Pretty Integers
1174A - Ehab Fails to Be Thanos
1169A - Circle Metro
780C - Andryusha and Colored Balloons
1153A - Serval and Bus
1487C - Minimum Ties
1136A - Nastya Is Reading a Book
1353B - Two Arrays And Swaps
1490E - Accidental Victory